A NOTE ON THE MODIFIED k-FIBONACCI-LIKE SEQUENCE

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fibonacci-like Sequence of Composite Numbers

In 1964, Ronald Graham proved that there exist relatively prime natural numbers a and b such that the sequence {An} defined by An = An−1 +An−2 (n ≥ 2;A0 = a,A1 = b) contains no prime numbers, and constructed a 34-digit pair satisfying this condition. In 1990, Donald Knuth found a 17-digit pair satisfying the same conditions. That same year, noting an improvement to Knuth’s computation, Herbert ...

متن کامل

A note on the bounds of Laplacian-energy-like-invariant

The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...

متن کامل

A Note on the Bounds for the Generalized Fibonacci-P-Sequence and its Application in Datahiding

In this paper, we suggest a lower and an upper bound for the Generalized Fibonaccip-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two consecutive terms in generalized Fibonacci sequence converges to a p-degree polynomial and then use this result to prove the bounds for generalized Fibonacci-...

متن کامل

A Note on Fibonacci-type Polynomials

We opt to study the convergence of maximal real roots of certain Fibonacci-type polynomials given by Gn = xGn−1 + Gn−2. The special cases k = 1 and k = 2 were done by Moore, and Zeleke and Molina, respectively. 1. Main Results In the sequel, P denotes the set of positive integers. The Fibonacci polynomials [2] are defined recursively by F0(x) = 1, F1(x) = x and Fn(x) = xFn−1(x) + Fn−2(x), n ≥ 2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications of the Korean Mathematical Society

سال: 2016

ISSN: 1225-1763

DOI: 10.4134/ckms.2016.31.1.001